Steiner Triple Systems and Existentially Closed Graphs
نویسندگان
چکیده
We investigate the conditions under which a Steiner triple system can have a 2or 3-existentially closed block intersection graph.
منابع مشابه
Existentially Closed BIBD Block-Intersection Graphs
A graph G with vertex set V is said to be n-existentially closed if, for every S ⊂ V with |S| = n and every T ⊆ S, there exists a vertex x ∈ V − S such that x is adjacent to each vertex of T but is adjacent to no vertex of S − T . Given a combinatorial design D with block set B, its block-intersection graph GD is the graph having vertex set B such that two vertices b1 and b2 are adjacent if and...
متن کاملProperties of the Steiner Triple Systems of Order 19
Properties of the 11 084 874 829 Steiner triple systems of order 19 are examined. In particular, there is exactly one 5-sparse, but no 6-sparse, STS(19); there is exactly one uniform STS(19); there are exactly two STS(19) with no almost parallel classes; all STS(19) have chromatic number 3; all have chromatic index 10, except for 4 075 designs with chromatic index 11 and two with chromatic inde...
متن کاملHamilton Decompositions of Block-Intersection Graphs of Steiner Triple Systems
Block-intersection graphs of Steiner triple systems are considered. We prove that the block-intersection graphs of non-isomorphic Steiner triple systems are themselves non-isomorphic. We also prove that each Steiner triple system of order at most 15 has a Hamilton decomposable block-intersection graph.
متن کاملBlock-Intersection Graphs of Steiner Triple Systems
A Steiner triple system of order n is a collection of subsets of size three, taken from the n-element set {0, 1, ..., n−1}, such that every pair is contained in exactly one of the subsets. The subsets are called triples, and a block-intersection graph is constructed by having each triple correspond to a vertex. If two triples have a non-empty intersection, an edge is inserted between their vert...
متن کاملOn Cliques in Spanning Graphs of Projective Steiner Triple Systems
We are interested in what sizes of cliques are to be found in any arbitrary spanning graph of a Steiner triple system S. In this paper we investigate spanning graphs of projective Steiner triple systems, proving, not surprisingly, that for any positive integer k and any sufficiently large projective Steiner triple system S, every spanning graph of S contains a clique of size k.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 12 شماره
صفحات -
تاریخ انتشار 2005